Multi-objective multi-factory scheduling

This paper introduces a multi-factory scheduling problem with heterogeneous factories and parallel machines. problem, as major part of supply chain planning, includes the finding suitable factory for each job assigned jobs at factory, simultaneously. For first time, this studies multi-objective in production network which has its customers demands can be satisfied by itself or other factories. In words, assumes that transfer from overloaded machine origin to fewer workloads imposing some transportation times. simultaneous minimization sum earliness tardiness total completion after modeling mixed-integer linear program, existing techniques are analyzed new one is applied our problem. Since NP-hard, heuristic algorithm also proposed generate set Pareto optimal solutions. Also, algorithms improve cover front. Computational experiences output model implemented CPLEX over randomly generated test problems reported.